Automated compositional proofs for real-time systems
نویسندگان
چکیده
منابع مشابه
Automated Compositional Proofs for Real-Time Systems
We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a small set of conditions concerning the integration of the different parts into a whole system. The refe...
متن کاملCompositional Proofs for Real-time Modular Systems
One common problem in applying formal methods to the analysis of realistic industrial-size systems is that these methods often do not scale well. In order to overcome such difficulty, formal languages and tools supporting modularization and compositionality must be realized and used. Under this respect, this thesis addresses the problem of designing techniques and tools to support the formal sp...
متن کاملCompositional Framework for Real-time Embedded Systems
COMPOSITIONAL FRAMEWORK FOR REAL-TIME EMBEDDED SYSTEMS Insik Shin Supervisor: Insup Lee An embedded system consists of a collection of components that interact with each other and with their environment through sensors and actuators. Two key characteristics of embedded systems are real-time and resource-constrained. As embedded systems become more complex due to increased functionalities, it is...
متن کاملCompositional Veri cation of Real - time Systems
This paper presents a compositional proof system for the veriication of real-time systems. Real-time systems are modeled as timed transition modules, which explicitly model interaction with the environment and may be combined using composition operators. Composition rules are devised such that the correct-ness of a system may be determined from the correct-ness of its components. These proof ru...
متن کاملCompositional Model Checking of Real Time Systems
A major problem in applying model checking to finite–state systems is the potential combinatorial explosion of the state space arising from parallel composition. Solutions of this problem have been attempted for practical applications using a variety of techniques. Recent work by Andersen [And95] proposes a very promising compositional model checking technique, which has experimentally been sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.02.003